Decompositions of Complete Graphs into Bipartite 2-Regular Subgraphs
نویسندگان
چکیده
منابع مشابه
Decompositions of Complete Graphs into Bipartite 2-Regular Subgraphs
It is shown that if G is any bipartite 2-regular graph of order at most n2 or at least n − 2, then the obvious necessary conditions are sufficient for the existence of a decomposition of the complete graph of order n into a perfect matching and edge-disjoint copies of G.
متن کاملEigensharp Graphs: Decomposition into Complete Bipartite Subgraphs
Let r(G) be the minimum number of complete bipartite subgraphs needed to partition the edges of G, and let r'G) be the larger of the number of positive and number of negative eigenvalues of G. It is known that T{G) > r(G); graphs with t(G) = r(G) are called eigensharp. Eigensharp graphs include graphs, trees, cycles Cn with n = 4 or n ^ 4k, prisms Cn\2K2 with n ^ 3fc, "twisted prisms" (also cal...
متن کاملoptimal orientations of subgraphs of complete bipartite graphs
for a graph g, let d(g) be the set of all strong orientations of g. the orientationnumber of g is min {d(d) |d belongs to d(g)}, where d(d) denotes the diameterof the digraph d. in this paper, we determine the orientation number for some subgraphs of complete bipartite graphs.
متن کاملNote on cyclic decompositions of complete bipartite graphs into cubes
So far, the smallest complete bipartite graph which was known to have a cyclic decomposition into cubes Qd of a given dimension d was Kd2d−1,d2d−2 . We improve this result and show that also Kd2d−2,d2d−2 allows a cyclic decomposition into Qd. We also present a cyclic factorization of K8,8 into Q4.
متن کاملHamiltonian decompositions of random bipartite regular graphs
We prove a complete hamiltonian decomposition theorem for random bipartite regular graphs, thereby verifying a conjecture of Robinson and Wormald. The main step is to prove contiguity (a kind of asymptotic equivalence) of two probabilistic models of 4-regular bipartite graphs; namely, the uniform model, and the model obtained by taking the union of two independent, uniformly chosen bipartite Ha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2016
ISSN: 1077-8926
DOI: 10.37236/4634